Multi-domain large deformations by monolithic approach for massive parallel computing
نویسندگان
چکیده
A monolithic approach is presented to solve multi-domain large deformations problems. It is based on an eulerian formulation using a fixed yet anisotropic adaptative mesh. Within this context, a level set method is used to capture the interface evolution of different domains. In terms of parallel computing, it is expected that the technique of single mesh and single mechanical solver developed under CimLib allows to obtain easily a very good scalability up to several hundred processors.
منابع مشابه
An Efficient Parallel Computing Method for the Processing of Large Sensed Data
In recent years we witness the advent of the Internet of Things and the wide deployment of sensors in many applications for collecting and aggregating data. Efficient techniques are required to analyze these massive data for supporting intelligent decisions making. Partial differential problems which involve large data are the most common in the engineering and scientific research. For simulati...
متن کاملParallelization of the Traffic Flow Management Problem
This paper describes a parallel approach to solving the national air traffic flow management problem. High fidelity, aircraft-level approaches to this problem can determine which flights should be held on the ground or in an enroute sector. The major drawback to such aircraft-by-aircraft approaches lies in the large amount of data and resulting massive problem instances to be solved for nationw...
متن کاملStrip Decomposition Parallelization of Fast Direct Poisson Solver on a 3D Cartesian Staggered Grid
A strip domain decomposition parallel algorithm for fast direct Poisson solver is presented on a 3D Cartesian staggered grid. The parallel algorithm follows the principles of sequential algorithm for fast direct Poisson solver. Both Dirichlet and Neumann boundary conditions are addressed. Several test cases are likewise addressed in order to shed light on accuracy and efficiency in the strip do...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کامل